NP-complete problems - PDFSEARCH.IO - Document Search Engine

NP-complete problems
Results: 1536

#	Item
611	Practical Partition-Based Theorem Proving for Large Knowledge Bases Sheila McIlraith Bill MacCartney Knowledge Systems Lab Knowledge Systems Lab Computer Science Dept. Computer Science Dept. Stanford University Add to Reading List Source URL: www.ksl.stanford.edu Language: English - Date: 2003-06-20 17:12:42 Automated theorem proving Combinatorics NP-complete problems Graph partition Resolution Partition Tree decomposition First-order logic Mathematics Graph theory Theoretical computer science
612	Implicit Hitting Set Problems, Multi-Genome Alignment and Colorful Connected Subgraphs Richard M. Karp CPM New York, June, 2010 Add to Reading List Source URL: www.cs.ucr.edu Language: English - Date: 2010-08-20 17:45:40 Combinatorics Matroid theory Combinatorial optimization Set cover problem Matroid Feedback vertex set Maximum cut Greedy algorithm Mathematics Theoretical computer science NP-complete problems
613	Numeric Bounds Analysis with Conflict-Driven Learning? Vijay D’Silva?? , Leopold Haller, Daniel Kroening, and Michael Tautschnig Computer Science Department, University of Oxford Add to Reading List Source URL: www.cs.ox.ac.uk Language: English - Date: 2012-07-25 13:39:19 Applied mathematics Electronic design automation Formal methods Logic in computer science NP-complete problems Valuation Boolean satisfiability problem Local consistency Abstract interpretation Theoretical computer science Constraint programming Mathematics
614	Lower bounds based on the Exponential Time Hypothesis Daniel Lokshtanov∗ Dániel Marx† Add to Reading List Source URL: www.win.tue.nl Language: English - Date: 2013-05-30 15:14:06 NP-complete problems Complexity classes Mathematical optimization Analysis of algorithms Parameterized complexity Exponential time hypothesis NP-complete Time complexity Feedback vertex set Theoretical computer science Computational complexity theory Applied mathematics
615	Effective Caching Techniques for Accelerating Pattern Matching Queries Arash Fard, Satya Manda, Lakshmish Ramaswamy, and John A. Miller Computer Science Department The University of Georgia Athens, GA, USA Add to Reading List Source URL: cobweb.cs.uga.edu Language: English - Date: 2014-10-20 13:30:52 NP-complete problems Tree Subgraph isomorphism problem Graph Vertex Neighbourhood Matching Graph operations Line graph Graph theory Mathematics Theoretical computer science
616	1 Fixed-Parameter Tractability In this chapter, we introduce parameterized problems and the notion of fixed-parameter tractability. We start with an informal discussion that highlights the main issues behind the definiti Add to Reading List Source URL: lii.rwth-aachen.de Language: English - Date: 2014-02-04 08:14:43 NP-complete problems Analysis of algorithms Computability theory Complexity classes Parameterized complexity Dominating set Time complexity Computable function Parameter Theoretical computer science Computational complexity theory Applied mathematics
617	Acknowledgements Organising a workshop (however small) is a job that involves a lot of organisation. This workshop is no exception. There have been many people involved and we would like to take this opportunity to thank Add to Reading List Source URL: www.cs.bris.ac.uk Language: English - Date: 2014-03-11 07:07:08 Random regular graph Neighbourhood NP-complete problems Graph coloring Planar graphs Expander graph Graph theory Connectivity Graph
618	Preprint. To appear in Algorithmica. DOIs00453 – Online available. On Making a Distinguished Vertex of Minimum Degree by Vertex Deletion Nadja Betzler1 · Hans L. Bodlaender · Add to Reading List Source URL: fpt.akt.tu-berlin.de Language: English - Date: 2012-10-16 08:46:15 NP-complete problems Graph operations Analysis of algorithms Parameterized complexity Feedback vertex set Tree decomposition Vertex cover Dominating set Kernelization Graph theory Theoretical computer science Mathematics
619	Preprint. To appear in Data Mining and Knowledge Discovery. DOIs10618 – Online available. The Effect of Homogeneity on the Computational Complexity of Combinatorial Data Anonymization Robert Bredere Add to Reading List Source URL: fpt.akt.tu-berlin.de Language: English - Date: 2012-10-16 08:46:46 Analysis of algorithms Parameterized complexity Time complexity Anonymity Matrix NP-complete problems Theoretical computer science Computational complexity theory Applied mathematics
620	Parameterized Algorithmics for Computational Social Choice: Nine Research Challenges Robert Bredereck1 , Jiehua Chen1 , Piotr Faliszewski2 , Jiong Guo3 , Rolf Niedermeier1 , and Gerhard J. Woeginger4 1 Add to Reading List Source URL: fpt.akt.tu-berlin.de Language: English - Date: 2014-12-01 07:16:49 Analysis of algorithms NP-complete problems Complexity classes Parameterized complexity Kernelization Vertex cover Time complexity Combinatorial optimization Approximation algorithm Theoretical computer science Computational complexity theory Applied mathematics

UPDATE